TSTP Solution File: CSR151^1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : CSR151^1 : TPTP v8.1.2. Released v4.1.0.
% Transfm : none
% Format : tptp
% Command : do_cvc5 %s %d
% Computer : n001.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Wed Aug 30 21:07:23 EDT 2023
% Result : Theorem 0.21s 0.54s
% Output : Proof 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : CSR151^1 : TPTP v8.1.2. Released v4.1.0.
% 0.00/0.14 % Command : do_cvc5 %s %d
% 0.14/0.36 % Computer : n001.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Mon Aug 28 13:05:35 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.21/0.50 %----Proving TH0
% 0.21/0.51 %------------------------------------------------------------------------------
% 0.21/0.51 % File : CSR151^1 : TPTP v8.1.2. Released v4.1.0.
% 0.21/0.51 % Domain : Commonsense Reasoning
% 0.21/0.51 % Problem : Is it the case that in 2009 Sue liked Bill and Mary liked Bill?
% 0.21/0.51 % Version : Especial > Reduced > Especial.
% 0.21/0.51 % English : During 2009 Mary liked Bill and Sue liked Bill. Is it the case
% 0.21/0.51 % that in 2009 Sue liked Bill and Mary liked Bill?
% 0.21/0.51
% 0.21/0.51 % Refs : [PS07] Pease & Sutcliffe (2007), First Order Reasoning on a L
% 0.21/0.51 % : [BP10] Benzmueller & Pease (2010), Progress in Automating Hig
% 0.21/0.51 % : [Ben10] Benzmueller (2010), Email to Geoff Sutcliffe
% 0.21/0.51 % Source : [Ben10]
% 0.21/0.51 % Names : paar_7.tq_SUMO_local [Ben10]
% 0.21/0.51
% 0.21/0.51 % Status : Theorem
% 0.21/0.51 % Rating : 0.09 v8.1.0, 0.08 v7.4.0, 0.11 v7.3.0, 0.10 v7.2.0, 0.12 v7.1.0, 0.14 v7.0.0, 0.12 v6.4.0, 0.14 v6.3.0, 0.17 v6.2.0, 0.00 v6.1.0, 0.50 v6.0.0, 0.00 v5.3.0, 0.25 v5.0.0, 0.50 v4.1.0
% 0.21/0.51 % Syntax : Number of formulae : 10 ( 0 unt; 8 typ; 0 def)
% 0.21/0.51 % Number of atoms : 6 ( 0 equ; 0 cnn)
% 0.21/0.51 % Maximal formula atoms : 3 ( 3 avg)
% 0.21/0.51 % Number of connectives : 16 ( 0 ~; 0 |; 2 &; 14 @)
% 0.21/0.51 % ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% 0.21/0.51 % Maximal formula depth : 5 ( 5 avg)
% 0.21/0.51 % Number of types : 3 ( 1 usr)
% 0.21/0.51 % Number of type conns : 5 ( 5 >; 0 *; 0 +; 0 <<)
% 0.21/0.51 % Number of symbols : 7 ( 7 usr; 4 con; 0-2 aty)
% 0.21/0.51 % Number of variables : 0 ( 0 ^; 0 !; 0 ?; 0 :)
% 0.21/0.51 % SPC : TH0_THM_NEQ_NAR
% 0.21/0.51
% 0.21/0.51 % Comments : This is a simple test problem for reasoning in/about SUMO.
% 0.21/0.51 % Initally the problem has been hand generated in KIF syntax in
% 0.21/0.51 % SigmaKEE and then automatically translated by Benzmueller's
% 0.21/0.51 % KIF2TH0 translator into THF syntax.
% 0.21/0.51 % : The translation has been applied in two modes: local and SInE.
% 0.21/0.51 % The local mode only translates the local assumptions and the
% 0.21/0.51 % query. The SInE mode additionally translates the SInE-extract
% 0.21/0.51 % of the loaded knowledge base (usually SUMO).
% 0.21/0.51 % : The examples are selected to illustrate the benefits of
% 0.21/0.51 % higher-order reasoning in ontology reasoning.
% 0.21/0.51 %------------------------------------------------------------------------------
% 0.21/0.51 %----The extracted Signature
% 0.21/0.51 thf(numbers,type,
% 0.21/0.51 num: $tType ).
% 0.21/0.51
% 0.21/0.51 thf(holdsDuring_THFTYPE_IiooI,type,
% 0.21/0.51 holdsDuring_THFTYPE_IiooI: $i > $o > $o ).
% 0.21/0.51
% 0.21/0.51 thf(lBill_THFTYPE_i,type,
% 0.21/0.51 lBill_THFTYPE_i: $i ).
% 0.21/0.51
% 0.21/0.51 thf(lMary_THFTYPE_i,type,
% 0.21/0.51 lMary_THFTYPE_i: $i ).
% 0.21/0.51
% 0.21/0.51 thf(lSue_THFTYPE_i,type,
% 0.21/0.51 lSue_THFTYPE_i: $i ).
% 0.21/0.51
% 0.21/0.51 thf(lYearFn_THFTYPE_IiiI,type,
% 0.21/0.51 lYearFn_THFTYPE_IiiI: $i > $i ).
% 0.21/0.51
% 0.21/0.51 thf(likes_THFTYPE_IiioI,type,
% 0.21/0.51 likes_THFTYPE_IiioI: $i > $i > $o ).
% 0.21/0.51
% 0.21/0.51 thf(n2009_THFTYPE_i,type,
% 0.21/0.51 n2009_THFTYPE_i: $i ).
% 0.21/0.51
% 0.21/0.51 %----The translated axioms
% 0.21/0.51 thf(ax,axiom,
% 0.21/0.51 ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i )
% 0.21/0.51 @ ( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
% 0.21/0.51 & ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i ) ) ) ).
% 0.21/0.51
% 0.21/0.51 %----The translated conjectures
% 0.21/0.51 thf(con,conjecture,
% 0.21/0.51 ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i )
% 0.21/0.51 @ ( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
% 0.21/0.51 & ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i ) ) ) ).
% 0.21/0.51
% 0.21/0.51 %------------------------------------------------------------------------------
% 0.21/0.51 ------- convert to smt2 : /export/starexec/sandbox/tmp/tmp.2ZW0aXSi1Q/cvc5---1.0.5_20613.p...
% 0.21/0.51 (declare-sort $$unsorted 0)
% 0.21/0.51 (declare-sort tptp.num 0)
% 0.21/0.51 (declare-fun tptp.holdsDuring_THFTYPE_IiooI ($$unsorted Bool) Bool)
% 0.21/0.51 (declare-fun tptp.lBill_THFTYPE_i () $$unsorted)
% 0.21/0.51 (declare-fun tptp.lMary_THFTYPE_i () $$unsorted)
% 0.21/0.51 (declare-fun tptp.lSue_THFTYPE_i () $$unsorted)
% 0.21/0.51 (declare-fun tptp.lYearFn_THFTYPE_IiiI ($$unsorted) $$unsorted)
% 0.21/0.51 (declare-fun tptp.likes_THFTYPE_IiioI ($$unsorted $$unsorted) Bool)
% 0.21/0.51 (declare-fun tptp.n2009_THFTYPE_i () $$unsorted)
% 0.21/0.51 (assert (@ (@ tptp.holdsDuring_THFTYPE_IiooI (@ tptp.lYearFn_THFTYPE_IiiI tptp.n2009_THFTYPE_i)) (and (@ (@ tptp.likes_THFTYPE_IiioI tptp.lMary_THFTYPE_i) tptp.lBill_THFTYPE_i) (@ (@ tptp.likes_THFTYPE_IiioI tptp.lSue_THFTYPE_i) tptp.lBill_THFTYPE_i))))
% 0.21/0.54 (assert (not (@ (@ tptp.holdsDuring_THFTYPE_IiooI (@ tptp.lYearFn_THFTYPE_IiiI tptp.n2009_THFTYPE_i)) (and (@ (@ tptp.likes_THFTYPE_IiioI tptp.lSue_THFTYPE_i) tptp.lBill_THFTYPE_i) (@ (@ tptp.likes_THFTYPE_IiioI tptp.lMary_THFTYPE_i) tptp.lBill_THFTYPE_i)))))
% 0.21/0.54 (set-info :filename cvc5---1.0.5_20613)
% 0.21/0.54 (check-sat-assuming ( true ))
% 0.21/0.54 ------- get file name : TPTP file name is CSR151^1
% 0.21/0.54 ------- cvc5-thf : /export/starexec/sandbox/solver/bin/cvc5---1.0.5_20613.smt2...
% 0.21/0.54 --- Run --ho-elim --full-saturate-quant at 10...
% 0.21/0.54 % SZS status Theorem for CSR151^1
% 0.21/0.54 % SZS output start Proof for CSR151^1
% 0.21/0.54 (
% 0.21/0.54 (let ((_let_1 (@ (@ tptp.likes_THFTYPE_IiioI tptp.lMary_THFTYPE_i) tptp.lBill_THFTYPE_i))) (let ((_let_2 (@ (@ tptp.likes_THFTYPE_IiioI tptp.lSue_THFTYPE_i) tptp.lBill_THFTYPE_i))) (let ((_let_3 (@ tptp.holdsDuring_THFTYPE_IiooI (@ tptp.lYearFn_THFTYPE_IiiI tptp.n2009_THFTYPE_i)))) (let ((_let_4 (not (@ _let_3 (and _let_2 _let_1))))) (let ((_let_5 (@ _let_3 (and _let_1 _let_2)))) (let ((_let_6 (ho_8 k_7 (ho_6 k_5 tptp.n2009_THFTYPE_i)))) (let ((_let_7 (ho_9 _let_6 BOOLEAN_TERM_VARIABLE_831))) (let ((_let_8 (ho_9 _let_6 BOOLEAN_TERM_VARIABLE_841))) (let ((_let_9 (forall ((u |u_(-> $$unsorted Bool)|) (e Bool) (i $$unsorted)) (not (forall ((v |u_(-> $$unsorted Bool)|)) (not (forall ((ii $$unsorted)) (= (ho_4 v ii) (ite (= i ii) e (ho_4 u ii)))))))))) (let ((_let_10 (forall ((x |u_(-> $$unsorted Bool)|) (y |u_(-> $$unsorted Bool)|)) (or (not (forall ((z $$unsorted)) (= (ho_4 x z) (ho_4 y z)))) (= x y))))) (let ((_let_11 (forall ((u |u_(-> $$unsorted $$unsorted Bool)|) (e |u_(-> $$unsorted Bool)|) (i $$unsorted)) (not (forall ((v |u_(-> $$unsorted $$unsorted Bool)|)) (not (forall ((ii $$unsorted)) (= (ho_3 v ii) (ite (= i ii) e (ho_3 u ii)))))))))) (let ((_let_12 (forall ((x |u_(-> $$unsorted $$unsorted Bool)|) (y |u_(-> $$unsorted $$unsorted Bool)|)) (or (not (forall ((z $$unsorted)) (= (ho_3 x z) (ho_3 y z)))) (= x y))))) (let ((_let_13 (forall ((u |u_(-> Bool Bool)|) (e Bool) (i Bool)) (not (forall ((v |u_(-> Bool Bool)|)) (not (forall ((ii Bool)) (= (ho_9 v ii) (ite (= i ii) e (ho_9 u ii)))))))))) (let ((_let_14 (forall ((x |u_(-> Bool Bool)|) (y |u_(-> Bool Bool)|)) (or (not (forall ((z Bool)) (= (ho_9 x z) (ho_9 y z)))) (= x y))))) (let ((_let_15 (forall ((u |u_(-> $$unsorted $$unsorted)|) (e $$unsorted) (i $$unsorted)) (not (forall ((v |u_(-> $$unsorted $$unsorted)|)) (not (forall ((ii $$unsorted)) (= (ho_6 v ii) (ite (= i ii) e (ho_6 u ii)))))))))) (let ((_let_16 (forall ((x |u_(-> $$unsorted $$unsorted)|) (y |u_(-> $$unsorted $$unsorted)|)) (or (not (forall ((z $$unsorted)) (= (ho_6 x z) (ho_6 y z)))) (= x y))))) (let ((_let_17 (forall ((u |u_(-> $$unsorted Bool Bool)|) (e |u_(-> Bool Bool)|) (i $$unsorted)) (not (forall ((v |u_(-> $$unsorted Bool Bool)|)) (not (forall ((ii $$unsorted)) (= (ho_8 v ii) (ite (= i ii) e (ho_8 u ii)))))))))) (let ((_let_18 (forall ((x |u_(-> $$unsorted Bool Bool)|) (y |u_(-> $$unsorted Bool Bool)|)) (or (not (forall ((z $$unsorted)) (= (ho_8 x z) (ho_8 y z)))) (= x y))))) (let ((_let_19 (APPLY_UF ho_9))) (let ((_let_20 (ho_4 (ho_3 k_2 tptp.lSue_THFTYPE_i) tptp.lBill_THFTYPE_i))) (let ((_let_21 (ho_4 (ho_3 k_2 tptp.lMary_THFTYPE_i) tptp.lBill_THFTYPE_i))) (let ((_let_22 (and _let_21 _let_20))) (let ((_let_23 (MACRO_SR_PRED_INTRO :args ((= _let_22 BOOLEAN_TERM_VARIABLE_831))))) (let ((_let_24 (REFL :args (_let_6)))) (let ((_let_25 (ho_9 _let_6 _let_22))) (let ((_let_26 (AND_ELIM (EQ_RESOLVE (MACRO_SR_PRED_TRANSFORM (AND_INTRO (EQ_RESOLVE (ASSUME :args (_let_5)) (PREPROCESS :args ((= _let_5 _let_25)))) (PREPROCESS :args ((and _let_18 _let_17 _let_16 _let_15 _let_14 _let_13 _let_12 _let_11 _let_10 _let_9)))) :args ((and _let_25 _let_18 _let_17 _let_16 _let_15 _let_14 _let_13 _let_12 _let_11 _let_10 _let_9))) (CONG (CONG _let_24 _let_23 :args _let_19) (REFL :args (_let_18)) (REFL :args (_let_17)) (REFL :args (_let_16)) (REFL :args (_let_15)) (REFL :args (_let_14)) (REFL :args (_let_13)) (REFL :args (_let_12)) (REFL :args (_let_11)) (REFL :args (_let_10)) (REFL :args (_let_9)) :args (and))) :args (0)))) (let ((_let_27 (and _let_20 _let_21))) (let ((_let_28 (MACRO_SR_PRED_INTRO :args ((= _let_27 BOOLEAN_TERM_VARIABLE_841))))) (let ((_let_29 (EQ_RESOLVE (ASSUME :args (_let_4)) (TRANS (PREPROCESS :args ((= _let_4 (not (ho_9 _let_6 _let_27))))) (CONG (CONG _let_24 _let_28 :args _let_19) :args (not)))))) (let ((_let_30 (not BOOLEAN_TERM_VARIABLE_831))) (let ((_let_31 (not _let_22))) (let ((_let_32 (not _let_21))) (let ((_let_33 (not _let_27))) (let ((_let_34 (EQUIV_ELIM2 _let_23))) (let ((_let_35 (EQUIV_ELIM2 _let_28))) (let ((_let_36 (not _let_7))) (let ((_let_37 (or))) (let ((_let_38 (not BOOLEAN_TERM_VARIABLE_841))) (let ((_let_39 (not _let_8))) (let ((_let_40 (MACRO_SR_PRED_INTRO :args ((= (not _let_39) _let_8))))) (let ((_let_41 (REFL :args (_let_36)))) (let ((_let_42 (ASSUME :args (_let_7)))) (let ((_let_43 (TRUE_INTRO _let_42))) (let ((_let_44 (_let_30))) (let ((_let_45 (ASSUME :args _let_44))) (let ((_let_46 (_let_38))) (let ((_let_47 (ASSUME :args _let_46))) (let ((_let_48 (SYMM (FALSE_INTRO _let_29)))) (let ((_let_49 (REORDERING (EQ_RESOLVE (NOT_AND (MACRO_SR_PRED_TRANSFORM (SCOPE (AND_INTRO _let_42 _let_45 _let_47 _let_29) :args (_let_7 _let_39 _let_30 _let_38)) (SCOPE (MACRO_SR_PRED_ELIM (TRANS _let_48 (CONG _let_24 (TRANS (FALSE_INTRO _let_47) (SYMM (FALSE_INTRO _let_45))) :args _let_19) _let_43)) :args (_let_7 _let_30 _let_38 _let_39)) :args ((not (and _let_7 _let_39 _let_30 _let_38)) SB_LITERAL))) (CONG _let_41 _let_40 (MACRO_SR_PRED_INTRO :args ((= (not _let_30) BOOLEAN_TERM_VARIABLE_831))) (MACRO_SR_PRED_INTRO :args ((= (not _let_38) BOOLEAN_TERM_VARIABLE_841))) :args _let_37)) :args ((or BOOLEAN_TERM_VARIABLE_831 BOOLEAN_TERM_VARIABLE_841 _let_8 _let_36))))) (let ((_let_50 (not _let_20))) (let ((_let_51 (ASSUME :args (BOOLEAN_TERM_VARIABLE_831)))) (let ((_let_52 (ASSUME :args (BOOLEAN_TERM_VARIABLE_841)))) (let ((_let_53 (MACRO_RESOLUTION_TRUST (MACRO_RESOLUTION_TRUST (REORDERING (EQ_RESOLVE (NOT_AND (MACRO_SR_PRED_TRANSFORM (SCOPE (AND_INTRO _let_42 _let_51 _let_52 _let_29) :args (BOOLEAN_TERM_VARIABLE_831 _let_7 BOOLEAN_TERM_VARIABLE_841 _let_39)) (SCOPE (MACRO_SR_PRED_ELIM (TRANS _let_48 (CONG _let_24 (TRANS (TRUE_INTRO _let_52) (SYMM (TRUE_INTRO _let_51))) :args _let_19) _let_43)) :args (_let_7 BOOLEAN_TERM_VARIABLE_831 BOOLEAN_TERM_VARIABLE_841 _let_39)) :args ((not (and BOOLEAN_TERM_VARIABLE_831 _let_7 BOOLEAN_TERM_VARIABLE_841 _let_39)) SB_LITERAL))) (CONG (REFL :args _let_44) _let_41 (REFL :args _let_46) _let_40 :args _let_37)) :args ((or _let_8 _let_36 _let_30 _let_38))) _let_29 _let_26 (REORDERING (EQUIV_ELIM1 _let_28) :args ((or BOOLEAN_TERM_VARIABLE_841 _let_33))) (REORDERING (EQUIV_ELIM1 _let_23) :args ((or BOOLEAN_TERM_VARIABLE_831 _let_31))) (REORDERING (CNF_AND_NEG :args (_let_27)) :args ((or _let_27 _let_32 _let_50))) (CNF_AND_NEG :args (_let_22)) :args ((or _let_32 _let_50) true _let_8 false _let_7 false BOOLEAN_TERM_VARIABLE_841 false BOOLEAN_TERM_VARIABLE_831 false _let_27 false _let_22)) (MACRO_RESOLUTION_TRUST _let_49 _let_29 _let_26 _let_35 _let_34 (REORDERING (CNF_AND_POS :args (_let_27 0)) :args ((or _let_20 _let_33))) (REORDERING (CNF_AND_POS :args (_let_22 1)) :args ((or _let_20 _let_31))) :args (_let_20 true _let_8 false _let_7 true BOOLEAN_TERM_VARIABLE_841 true BOOLEAN_TERM_VARIABLE_831 true _let_27 true _let_22)) :args (_let_32 false _let_20)))) (SCOPE (SCOPE (MACRO_RESOLUTION_TRUST _let_49 (MACRO_RESOLUTION_TRUST _let_35 (MACRO_RESOLUTION_TRUST (REORDERING (CNF_AND_POS :args (_let_27 1)) :args ((or _let_21 _let_33))) _let_53 :args (_let_33 true _let_21)) :args (_let_38 true _let_27)) (MACRO_RESOLUTION_TRUST _let_34 (MACRO_RESOLUTION_TRUST (REORDERING (CNF_AND_POS :args (_let_22 0)) :args ((or _let_21 _let_31))) _let_53 :args (_let_31 true _let_21)) :args (_let_30 true _let_22)) _let_29 _let_26 :args (false true BOOLEAN_TERM_VARIABLE_841 true BOOLEAN_TERM_VARIABLE_831 true _let_8 false _let_7)) :args (_let_5 _let_4 true))))))))))))))))))))))))))))))))))))))))))))))))))))))))
% 0.21/0.54 )
% 0.21/0.54 % SZS output end Proof for CSR151^1
% 0.21/0.54 % cvc5---1.0.5 exiting
% 0.21/0.55 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------